Finite fields - PDFSEARCH.IO - Document Search Engine

Finite fields
Results: 995

#	Item
121	d-dimensional symmetric bilinear DHO in V (((1/r)d2 + 3d + 2)/2, 2) The 11th International Conference on Finite Fields and their Applications, Otto-Von Guericke University (Magdeburg), July 23 – 26, 2013. Hiroaki Tanig Add to Reading List Source URL: www.math.uni-magdeburg.de Language: English - Date: 2013-08-14 05:46:40 Algebra Mathematics Linear algebra Vector space Linear map Dual space
122	Computing Class Groups of Function Fields over Finite Fields from Stark Units Ming-Deh Huang Computer Science Department University of Southern California Add to Reading List Source URL: www.math.uni-magdeburg.de Language: English Algebra Abstract algebra Ring theory Algebraic number theory Field theory Conjectures Divisor Euler system Stark conjectures Finite field BrumerStark conjecture Conductor
123	Visible Points on Curves over Finite Fields Igor E. Shparlinski Department of Computing, Macquarie University Sydney, NSW 2109, Australia Add to Reading List Source URL: www.ma.utexas.edu Language: English - Date: 2007-04-18 20:12:25 Mathematics Algebra Abstract algebra Algebraic varieties Divisor XTR Elliptic curve Rational function Algebraic curve Morphism of algebraic varieties
124	Gowers U3 norm of cubic bent Boolean functions Sugata Gangopadhyay Department of Mathematics Indian Institute of Technology Roorkee The 11th International Conference on Finite Fields and their Applications Add to Reading List Source URL: www.math.uni-magdeburg.de Language: English Mathematical analysis Mathematics Analysis Fourier analysis Functions and mappings Fourier transform Joseph Fourier Germ Derivative
125	Public-Key Cryptography for RFID-Tags? L. Batina1 , J. Guajardo2 , T. Kerins2 , N. Mentens1 , P. Tuyls2 , and I. Verbauwhede1 1 Katholieke Universiteit Leuven, ESAT/COSIC, Belgium {Lejla.Batina,Nele.Mentens,Ingrid.Verbau Add to Reading List Source URL: events.iaik.tugraz.at Language: English - Date: 2006-08-29 03:45:16 Public-key cryptography Notary Elliptic curve cryptography Randomness Finite fields Radio-frequency identification Authentication protocol Physical unclonable function Authentication Digital signature Quantum readout of PUFs Types of physical unclonable function
126	Fast Computation of Special Resultants ´ Alin Bostan a Philippe Flajolet a Bruno Salvy a Eric Schost b a Algorithms Add to Reading List Source URL: www.csd.uwo.ca Language: English - Date: 2005-07-11 17:31:38 Polynomials Computer algebra Algebra Symmetric functions Symmetric polynomial Finite field Irreducible polynomial Elementary symmetric polynomial XTR Resultant Splitting circle method Factorization of polynomials over finite fields
127	Conics over function fields and the Artin-Tate conjecture Jos´ e Felipe Voloch Abstract: We prove that the Hasse principle for conics over function fields is a simple consequence of a provable case of the Artin-Tate con Add to Reading List Source URL: www.ma.utexas.edu Language: English - Date: 2008-01-09 10:54:19 Algebraic number theory Algebraic curves Field theory Conjectures Diophantine geometry Tate conjecture Brauer group Algebraic number field Global field Divisor Finite field Artin
128	Master’s thesis in Mathematics The use of elliptic curves in cryptography by Gijsbert van Vliet Add to Reading List Source URL: www.math.ru.nl Language: English - Date: 2016-04-18 16:34:53 Group theory Finite fields Public-key cryptography Cryptography Key management Discrete logarithm Index calculus algorithm ElGamal encryption Key XTR DiffieHellman key exchange RSA
129	Francisco Rodr´ıguez-Henr´ıquez Associate Professor CINVESTAV 3-C CINVESTAV-IPN Av. Instituto Polit´ecnico Nacional No. 2508, 07360, M´exico City, M´exico Tel: (3800 Ext. 6570 Add to Reading List Source URL: delta.cs.cinvestav.mx Language: English - Date: 2015-03-12 01:14:57 Finite fields Elliptic curve cryptography Public-key cryptography Alfred Menezes Cryptography Elliptic curve CINVESTAV
130	Elementary 2-Group Character Codes Cunsheng Ding1 , David Kohel2 , and San Ling3 Abstract In this correspondence we describe a class of codes over GF (q), where q is a power of an odd prime. These codes are analogues of Add to Reading List Source URL: iml.univ-mrs.fr Language: English - Date: 2012-11-13 10:05:03 Coding theory Finite fields Error detection and correction Linear code ReedMuller code XTR Binomial coefficient